Automatic generation of variants depending on changes of product properties in a flexible manufacturing environment

Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

基于信号增强的缓慢泄漏检测方法

目前管道泄漏检测方法可有效检测突发泄漏，对于缓慢泄漏则存在检测灵敏度低、定位不准确等问题。基于此，提出了一种基于信号增强的缓慢泄漏检测方法。通过信号压缩（抽取及移位）克服缓慢泄漏压力信号下降平缓的缺点；根据声波信号具有波形尖锐突出、对突发泄漏敏感的优点，通过建立以压力为输入、虚拟声波为输出的声波信号变送器模型，将压力信号转换为声波信号，克服了泄漏压力信号容易被淹没在管道压力波动及背景噪声中的缺点，实现了缓慢泄漏信号的增强；利用临近插值方法重构虚拟声波信号，基于延时互相关分析实现了缓慢泄漏的准确定位。实验结果表明，该方法具有显著的信号增强效果和定位精度，实现了缓慢泄漏的准确检测。     

多先验融合的图像显著性目标检测算法

为了更加准确地检测出图像中的显著性目标，提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况，提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置，以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集MSRA1000和ESSCD上的仿真实验结果表明，MPLRR能够得到清晰高亮的显著性目标视觉效果图，同时F，AUC，MAE等评价指标也比现有的许多方法有明显提升。     

Optimal power flow by BAT search algorithm for generation reallocation with unified power flow controller

Optimal power flow with generation reallocation is a suitable method for better utilization of the existing system. In recent years, Flexible AC Transmission System (FACTS) devices, have led to the development of controllers that provide controllability and flexibility for power transmission. Out of the FACTS devices unified power flow controller (UPFC) is a versatile device, capable of controlling the power system parameters like voltage magnitude, phase angle and line impedance individually or simultaneously. The main aim of this paper is to minimize real power losses in a power system using BAT search algorithm without and with the presence of UPFC. Minimization of real power losses is done by considering the power generated by generator buses, voltage magnitudes at generator buses and reactive power injection from reactive power compensators. The proposed BAT algorithm based Optimal Power Flow (OPF) has been tested on a 5 bus test system and modified IEEE 30 bus system without and with UPFC. The results of the system with and without UPFC are compared in terms of active power losses in the transmission line using BAT algorithm. The obtained results are also compared with Genetic algorithm (GA).     

“聚龙一号”装置四层圆盘锥磁绝缘传输线的三维粒子模拟研究

介绍了"聚龙一号"中四层圆盘锥磁绝缘传输线(MITL)的基本理论。在CPIPIC平台上,采用非均匀网格和周期性对称边界条件,建立了"聚龙一号"的四层圆盘锥MITL的三维粒子模拟模型。设置相应的参数并用并行算法模拟得到了该器件中各层在绝缘堆上和MITL中间位置的电流和汇流后的电流,并与理论和实验数据进行相互对比验证。模拟结果表明整个器件在达到磁绝缘状态后具有很高的传输效率,并与实验结果相互验证,为以后进一步的研究提供了保证。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.